Data Flow Analysis Frameworks for Concurrent Programs (extended Abstract)
نویسنده
چکیده
In this abstract, we present complete-lattice data ow analysis frameworks. These are a generalization of semi-lattice based data ow analysis frameworks and are designed to support the description and solution of data ow analysis problems over ow graphs for concurrent programs. We describe the limitations of existing data ow frameworks as applied to concurrent programs; these limitations are addressed by complete-lattice frameworks. We present solution algorithms for problems formulated as complete-lattice frameworks and illustrate their utility by applying them to the solution of a well-studied data ow analysis problem.
منابع مشابه
Substructural Logical Specifications
A logical framework and its implementation should serve as a flexible tool for specifying, simulating, and reasoning about formal systems. When the formal systems we are interested in exhibit state and concurrency, however, existing logical frameworks fall short of this goal. Logical frameworks based on a rewriting interpretation of substructural logics, ordered and linear logic in particular, ...
متن کاملA Framework for Abstract Interpretation of Universal Timed Concurrent Constraint Programs
Universal timed concurrent constraint programming (utcc) is a generalization of timed ccp (tcc) aiming at modeling mobile reactive systems. In this paper we formalize a general framework for data flow analyses of utcc programs by abstract interpretation techniques. The abstract semantics we propose is compositional allowing us to reduce the complexity of data flow analyses. Furthermore it is pa...
متن کاملA Theorem Proving Approach to Secure Information Flow in Concurrent Programs (Extended Abstract)
We present an approach to formally prove secure information flow in multi-threaded programs. We start with a precise formalization of noninterference in dynamic logic and then use the rely/guarantee approach to reduce this to thread-modular properties, that can be checked locally. A sound and complete calculus ensures that these properties can be proven without false positives. Currently, we wo...
متن کاملNondeterministic Parallel Control-Flow / Definition-Use Nets and their Applications
A natural and abstract representation of control flow and/or data flow in programs is crucial to many software engineering activities including software analysis, testing, debugging, maintenance, and complexity measurement. However, although a number of representations have been proposed and studied for representing control flow and/or data flow in a sequential program, until recently, little a...
متن کاملPushdown Systems for Monotone Frameworks
Monotone frameworks is one of the most successful frameworks for intraprocedural data flow analysis extending the traditional class of bitvector frameworks (like live variables and available expressions). Weighted pushdown systems is similarly one of the most general frameworks for interprocedural analysis of programs. However, it makes use of idempotent semirings to represent the sets of prope...
متن کامل